An optimal matching problem
نویسندگان
چکیده
منابع مشابه
An Optimal Matching Problem
Suppose we are given three goods, X,Y , and Z. They are not homogeneous, but come in different qualities, x ∈ X , y ∈ Y and z ∈ Z. Goods X and Y are used for the sole purpose of producing good Z, which we are interested in. To obtain one piece of good Z, one has to assemble one piece of good X and one piece of good Y . More precisely, one can obtain a piece of quality z by assembling one piece ...
متن کاملThe Optimal Path-Matching Problem
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...
متن کاملAn Optimal Matching Problem for the Euclidean Distance
We deal with an optimal matching problem, that is, we want to transport two measures to a given place, where they will match, minimizing the total transport cost that in our case is given by the sum of the Euclidean distance that each measure is transported. We show that such a problem has a solution. Furthermore we perform a method to approximate the solution of the problem taking limit as p→∞...
متن کاملAn optimal control problem for a engineering system
In this article, we apply this new method for solving an engineering systemwith initial and boundary conditions and integral criterion ,and we will usingdynamic programming as iteration for solving model.
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations
سال: 2004
ISSN: 1292-8119,1262-3377
DOI: 10.1051/cocv:2004034